Dual Label-Guided Graph Refinement for Multi-View Graph Clustering
نویسندگان
چکیده
With the increase of multi-view graph data, clustering (MVGC) that can discover hidden clusters without label supervision has attracted growing attention from researchers. Existing MVGC methods are often sensitive to given graphs, especially influenced by low quality i.e., they tend be limited homophily assumption. However, widespread real-world data hardly satisfy This gap limits performance existing on homophilous graphs. To mitigate this limitation, our motivation is extract high-level view-common information which used refine each view's graph, and reduce influence non-homophilous edges. end, we propose dual label-guided refinement for (DuaLGR), alleviate vulnerability in facing Specifically, DuaLGR consists two modules named module encoder module. The first designed soft node features then learn a matrix. In cooperation with pseudo second module, these graphs refined aggregated adaptively different orders. Subsequently, consensus generated guidance label. Finally, encodes along produce iteratively clustering. experimental results show superior coping data. source code available at https://github.com/YwL-zhufeng/DuaLGR.
منابع مشابه
Multi-View Budgeted Learning under Label and Feature Constraints Using Label-Guided Graph-Based Regularization
Budgeted learning under constraints on both the amount of labeled information and the availability of features at test time pertains to a large number of real world problems. Ideas from multi-view learning, semisupervised learning, and even active learning have applicability, but a common framework whose assumptions fit these problem spaces is non-trivial to construct. We leverage ideas from th...
متن کاملMulti-view Clustering with Adaptively Learned Graph
Multi-view clustering, which aims to improve the clustering performance by exploring the data’s multiple representations, has become an important research direction. Graph based methods have been widely studied and achieve promising performance for multi-view clustering. However, most existing multi-view graph based methods perform clustering on the fixed input graphs, and the results are depen...
متن کاملLarge-Scale Multi-View Spectral Clustering via Bipartite Graph
In this paper, we address the problem of large-scale multi-view spectral clustering. In many real-world applications, data can be represented in various heterogeneous features or views. Different views often provide different aspects of information that are complementary to each other. Several previous methods of clustering have demonstrated that better accuracy can be achieved using integrated...
متن کاملDual-graph regularized concept factorization for clustering
In past decades, tremendous growths in the amount of text documents and images have become omnipresent, and it is very important to group them into clusters upon desired. Recently, matrix factorization based techniques, such as Non-negative Matrix Factorization (NMF) and Concept Factorization (CF), have yielded impressive results for clustering. However, both of them effectively see only the gl...
متن کاملOptimized Graph Search Using Multi-Level Graph Clustering
Graphs find a variety of use in numerous domains especially because of their capability to model common problems. The social networking graphs that are used for social networking analysis, a feature given by various social networking sites are an example of this. Graphs can also be visualized in the search engines to carry search operations and provide results. Various searching algorithms have...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i7.26057